#include"BinarySearchTree.h"

void BSTtest()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> T;
	for (int i = 0; i < 9; i++)
	{
		T.Insert(a[i]);
	}


	T.InOrder();
	cout << endl;

	for (auto e : a)
	{
		T.erase(e);
		T.InOrder();
		cout << endl;
	}
}

int main()
{
	BSTtest();

	return 0;
}